P-sufficient statistics for PAC learning k-term-DNF formulas through enumeration
نویسندگان
چکیده
منابع مشابه
P-Sufficient Statistics for PAC Learning k-term-DNF Formulas through Enumeration
Working in the framework of PAC-learning theory, we present special statistics for accomplishing in polynomial time proper learning of DNF boolean formulas having a fixed number of monomials. Our statistics turn out to be near sufficient for a large family of distribution laws—that we call butterfly distributions. We develop a theory of most powerful learning for analyzing the performance of le...
متن کاملProper Learning of k-term DNF Formulas from Satisfying Assignments
In certain applications there may only be positive samples available to to learn concepts of a class of interest, and this has to be done properly, i. e. the hypothesis space has to coincide with the concept class, and without false positives, i. e. the hypothesis always has be a subset of the real concept (one-sided error). For the well studied class of k-term DNF formulas it has been known th...
متن کاملILP Through Propositionalization and Stochastic k-Term DNF Learning
ILP has been successfully applied to a variety of tasks. Nevertheless, ILP systems have huge time and storage requirements, owing to a large search space of possible clauses. Therefore, clever search strategies are needed. One promising family of search strategies is that of stochastic local search methods. These methods have been successfully applied to propositional tasks, such as satisfiabil...
متن کاملLearning Talagrand DNF Formulas
Consider the following version of Talagrand’s probabilistic construction of a monotone function f : {0, 1} n → {0, 1}. Let f be an n-term monotone DNF formula where each term is selected independently and uniformly at random (with replacement) from the set of all n log n) possible terms of length log(n) over the first log(n) variables. Let us call such a DNF formula a Talagrand DNF formula. Thi...
متن کاملLearning Nearly Monotone k-term DNF
This note studies the learnability of the class k-term DNF with a bounded number of negations per term. We study the case of learning with membership queries alone, and give tight upper and lower bounds on the number of negations that makes the learning task feasible. We also prove a negative result for equivalence queries. Finally, we show that a slight modiication in our algorithm proves that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00215-1